Approximations for subset interconnection designs
نویسندگان
چکیده
منابع مشابه
The Subset Interconnection Design problem with Subset Uncertainty
Subset Interconnection Design is an NP −hard problem which draws its motivation from various applications, such as the design of scalable overlay networks, the inference of inter-molecular protein connectivity, the design of vacuum systems and several other problems in the industry. In that problem, we are given a set of vertices V and a collection S of subsets of V and we want to find an edge ...
متن کاملPolynomial-Time Data Reduction for the Subset Interconnection Design Problem
The NP-hard Subset Interconnection Design problem, also known as Minimum Topic-Connected Overlay, is motivated by numerous applications including the design of scalable overlay networks and vacuum systems. It has as input a finite set V and a collection of subsets V1, V2, . . . , Vm ⊆ V , and asks for a minimum-cardinality edge set E such that for the graph G = (V, E) all induced subgraphs G[V1...
متن کاملEecient Interconnection Designs for Switch-based Local Area Networks 1
Today, with the proliferation of switch-based local area network standards, such as ATM (Asynchronous Transfer Mode), HIPPI (HIgh Performance Parallel Interface) and Fibre Channel, the issue of the eecient interconnection among connection-oriented switches arises. This paper presents a study of eecient arrangements of switches intended to support a local area network environment. This multi-swi...
متن کاملExponential Models: Approximations for Probabilities
Welch & Peers (1963) used a root-information prior to obtain posterior probabilities for a scalar parameter exponential model and showed that these Bayes probabilities had the confidence property to second order asymptotically. An important undercurrent of this indicates that the constant information reparameterization provides location model structure, for which the confidence property ...
متن کاملSPHERICAL tε-DESIGNS FOR APPROXIMATIONS ON THE SPHERE
A spherical t-design is a set of points on the unit sphere that are nodes of a quadrature rule with positive equal weights that is exact for all spherical polynomials of degree ≤ t. The existence of a spherical t-design with (t + 1)2 points in a set of interval enclosures on the unit sphere S2 ⊂ R3 for any 0 ≤ t ≤ 100 is proved in [17, Chen, Frommer, Lang, Computational existence proofs for sph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00062-0